ELAN from a rewriting logic point of view

ELAN from a rewriting logic point of view

ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule based processes. With the general goal to make precise a rewriting logic based semantics of ELAN, this paper has three contributions: a presentati...

Rewriting Logic from a ρLog Point of View

Rewriting logic is a well-known logic that emerged as an adequate logical and semantic framework for the specification of languages and systems. ρLog is a calculus for rule-based programming with labeled rules. Its expressive power stems from the usage of a fragment of higher-order logic (e.g., sequence variables, and function variables) to express atomic formulas. Its adequacy as a computation...

A rewriting point of view on strategies

This paper is an expository contribution reporting on published work. It focuses on an approach followed in the rewriting community to formalize the concept of strategy. Based on rewriting concepts, several definitions of strategy are reviewed and connected: in order to catch the higher-order nature of strategies, a strategy is defined as a proof term expressed in the rewriting logic or in the ...

Path Constraints from a Modal Logic Point of View

We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding them in Propositional Dynamic Logic. While some of our decidability results were known before, we believe that our improved complexity bounds are new. Our proofs, based on techniques from modal logic, shed additional ...

The ELAN Environment: a Rewriting Logic Environment based on ASF+SDF Technology - System Demonstration